Transient product from distributions in queueing networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transient product from distributions in queueing networks

In this paper it is shown that a necessary and sufficiënt condition for a Marko-vian queueing network to have transient product form is that all queues are infmite server queues.

متن کامل

Product Form Queueing Networks

Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a powerful and versatile tool for system performance evaluation and prediction. Product form queueing networks have a simple closed form expression of the stationary state distribution that allow to define efficient algorit...

متن کامل

Transient Behaviour of Queueing Networks

In most contemporary queueing network analysis, the assumption is made that a network is in a state of equilibrium. That is, the network's state space probabilities are assumed to be time independent. It is therefore important to be able to quantify precisely when this assumption is valid. Furthermore there are also situations in which it is desirable to model the transient behaviour of network...

متن کامل

Transient Behavior of Queueing Networks

We present algorithms for approximating time-varying performance parameters for a Gt/G/c queuing system and for networks of such stations. The key ingredient is a formula for computing approximate sojourn time distributions for a Gt/G/c queuing system with time-varying arrivals and phase-type service times. The formula is based on transient Little laws expressing expected queue lengths and outp...

متن کامل

Analytical approximation of transient joint queue-length distributions within finite capacity Markovian queueing networks

This paper presents an analytical approximate and computationally tractable technique for the transient analysis of finite capacity Markovian networks. The approach is based on a network decomposition that is unique, it decomposes the network into overlapping (non-disjoint) subnetworks. The model approximates the transient queue-length distributions of the subnetworks. It is computationally tra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Event Dynamic Systems: Theory and Applications

سال: 1993

ISSN: 0924-6703,1573-7594

DOI: 10.1007/bf01439160